Manifold calculus adapted for simplicial complexes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New methods for constructing shellable simplicial complexes

A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...

متن کامل

GAP toolbox for simplicial complexes

simpcomp is a GAP package for working with simplicial complexes. It allows the computation of many properties of simplicial complexes (such as the f -, gand h-vectors, the face lattice, the automorphism group, (co-)homology with explicit basis computation, intersection form, etc.) and provides the user with functions to compute new complexes from old (simplex links and stars, connected sums, ca...

متن کامل

Duality theorems for simplicial complexes

This thesis deals with the homology and cohomology groups of simplicial complexes, and especially with the two duality theorems which willdemonstrate links between the two notions. For this we will need some results, and we will therefore prove the long exact sequence for the reduced relative homology group; and to link the homology and cohomolgy to our geometric notion of a simplicial complex ...

متن کامل

Saturated simplicial complexes

Among shellable complexes a certain class has maximal modular homology, and these are the so-called saturated complexes. We extend the notion of saturation to arbitrary pure complexes and give a survey of their properties. It is shown that saturated complexes can be characterized via the p -rank of incidence matrices and via the structure of links. We show that rank-selected subcomplexes of sat...

متن کامل

Completions and Simplicial Complexes

We first introduce the notion of a completion. Completions are inductive properties which may be expressed in a declarative way and which may be combined. We show that completions may be used for describing structures or transformations which appear in combinatorial topology. We present two completions, 〈CUP〉 and 〈CAP〉, in order to define, in an axiomatic way, a remarkable collection of acyclic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Homology, Homotopy and Applications

سال: 2019

ISSN: 1532-0073,1532-0081

DOI: 10.4310/hha.2019.v21.n1.a8